CCCG 2007, Ottawa, Ontario, August 20–22, 2007 The Harmony of Spheres Otfried Cheong∗ Let F = {X1 , . . . , Xn } be a family of disjoint compact convex sets in Rd . An oriented straight line ` that

Source URL: cccg.ca

• Permutation
• Geometry
• Science
• Combinatorics
• Group theory
• Transversal

1 Encapsulation theory: the transformation equations of absolute information  hiding. Edmund Kirwan* www.EdmundKirwan.com

Source URL: edmundkirwan.com

• Measure
• Combinatorics
• Group theory
• Mathematics
• Disjoint sets
• Addition

Algorithms Lecture 17: Disjoint Sets [Fa’13] E pluribus unum (Out of many, one) — Official motto of the United States of America

Source URL: web.engr.illinois.edu

• Data structures
• Disjoint-set data structure
• Splay tree
• Function
• Exponentiation
• Tree traversal
• Fibonacci heap
• Tango tree
• Mathematics
• Binary trees
• Mathematical analysis

COMS21103 Disjoint sets and minimum spanning trees Ashley Montanaro Department of Computer Science, University of Bristol

Source URL: www.cs.bris.ac.uk

• Disjoint-set data structure
• Disjoint sets
• Connected space
• Category of sets
• Partition refinement
• Mathematics
• Data structures
• General topology

1994 Paper 2 Question 2 A bipartite graph is one where the vertices can be partitioned into two disjoint sets A and B such that every edge of the graph has one end at a vertex in A and the other at a vertex in B. Are th

Source URL: www.cl.cam.ac.uk

A two-mode directed weighted network () is based on two sets –a set of vertices that consists of two disjoint set of vertices and , that represent the selected units; and a set of arcs (), that represent

Source URL: leblog.gerpisa.org

• Networks
• Network analysis
• Algebraic graph theory
• Centrality
• Betweenness centrality
• Clustering coefficient
• Weighted network
• Distance
• Social network analysis
• Graph theory
• Mathematics
• Network theory

ALMOST DISJOINT AND INDEPENDENT FAMILIES STEFAN GESCHKE Abstract. I collect a number of proofs of the existence of large almost disjoint and independent families on the natural numbers. This is mostly the outcome of a di

Source URL: www.hcm.uni-bonn.de

• Order theory
• General topology
• Infinity
• Ordinal numbers
• Almost disjoint sets
• Constructible universe
• Compact space
• Ultrafilter
• Aleph number
• Mathematics
• Mathematical logic
• Topology

Fourteenth International Olympiad, [removed]Prove that from a set of ten distinct two-digit numbers (in the decimal system), it is possible to select two disjoint subsets whose members have the same sum[removed].

Source URL: media.hotnews.ro

• Maths24
• COMPASS/Sample Code
• Character sets

The Complexity of Unions of Disjoint Sets Christian Glaßer∗, Alan L. Selman†, Stephen Travers‡, and Klaus W. Wagner∗ Abstract This paper is motivated by the open question whether the union of two disjoint NPcomp

Source URL: www.cse.buffalo.edu

• Complexity classes
• Computability theory
• NP-complete problems
• Structural complexity theory
• Polynomial hierarchy
• NP
• PP
• Many-one reduction
• Oracle machine
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

The Conjoint/Disjoint Alternation in Sambaa∗ Leston Buell and Kristina Riedel Bantu Syntax Project, Leiden University TiN-dag, Utrecht, 2 February, [removed]

Source URL: www.fizzylogic.com

• Disjoint sets
• Wh-movement
• Zulu language
• Linguistics
• Syntax
• Agglutinative languages